CSC 2420 : Lecture 10 Streaming Algorithms : Frequency Moments and Count

نویسندگان

  • Allan Borodin
  • Amirali Salehi-Abari
چکیده

Usually, a streaming algorithm is used in scenarios in which there are a lot of data (items) arriving and there is a space or time limitation for storage of data and processing later. More precisely, streaming algorithms are on-line algorithms which process the data streams. Each data stream is a long sequence of items arriving rapidly, denoted by I1, I2, ..., It, ..., Im where It is the t th items and m is the length of data stream. There are various data stream models depending on how to represent It: • Time Series Model. In this model, It is represented as ait where ait ∈ {a1, a2, ..., an}. So the data stream is the sequence of items such that each item belongs to {a1, a2, ..., an}. • Cash Register Model. In this model, < a1(t), a2(t), ..., an(t) > is the state at time t. Upon arriving item It which is modeled as pair of (j, ct), ai(t) will be calculated as follows:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

236779 : Foundations of Algorithms for Massive Datasets Nov 11 2015 Lecture

These notes cover the end of the Frequent-items (Batch-Decrement) sketch, the Count-Min sketch, the F2 Tug-of-War sketch (AMS), and initial background for dimensionality reduction and the Johnson-Lindenstrauss transform. 1 Reminder: Frequency Moments We are given a stream (sequence) of N characters (or items) a1, a2, . . . , aN from a large alphabet Σ of size |Σ| = n. Definition 1. A histogram ...

متن کامل

CSC 2420 - Fall 2010 - Lecture 5

In the previous lecture we developed an LP formulation for the f -frequency weighted set cover problem and further noted that the weighted vertex cover problem is a case of 2-frequency covering problem. We also considered a greedy algorithm for the set cover problem and claimed that it has an approximation ratio of Hd. This claim is proved in this class using the dual fitting analysis. 1 Weight...

متن کامل

Hybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage

In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...

متن کامل

Asymptotically exact streaming algorithms

We introduce a new computational model for data streams: asymptotically exact streaming algorithms. These algorithms have an approximation ratio that tends to one as the length of the stream goes to infinity while the memory used by the algorithm is restricted to polylog(n) size. Thus, the output of the algorithm is optimal in the limit. We show positive results in our model for a series of imp...

متن کامل

5 . Applications to streaming

In this lecture, we will see applications of communication complexity to proving lower bounds for streaming algorithms. Towards the end of the lecture, we will introduce combinatorial auctions, and we will see applications of communication complexity to auctions in the next lecture. The references for this lecture include Lecture 7 of Troy Lee’s course on communication complexity [Lee10], Lectu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010